Optimization of First Passage Times by Multiple Cooperating Mobile Traps

نویسندگان

  • Alan E. Lindsay
  • J. C. Tzou
  • Theodore Kolokolnikov
چکیده

Abstract. We study the mean capture time of an unbiased random walker by multiple absorbing mobile traps in bounded domains of one and two spatial dimensions. In one dimension, we consider multiple traps undergoing prescribed oscillatory motion on an interval with reflecting or absorbing boundary conditions. We develop trap co-operation strategies which optimize the mean capture time. We find that as the frequency of oscillation passes through certain fixed values, the optimal trap strategy alternates between oscillating exactly in phase and exactly out-of-phase with neighboring traps. We also demonstrate a scenario in which the optimal configuration is neither in phase nor antiphase. In two dimensions, we consider two small traps rotating with the same angular velocity ω inside a unit disk, and characterize the optimal positions (radii of rotation and relative phase) of the two traps as a function of ω and trap radius ε ≪ 1. We identify several distinguished regimes in ω where the optimal configuration can be distinctly characterized. In particular, in the ω ∼ O(1) regime, the optimal configuration jumps from one in which two traps rotate antipodal and along the same radius to one where the two traps rotate on the same side of the disk but at different radii. In addition, we demonstrate an algebraic approach to obtaining optimal configurations of N rotating traps as ω → ∞.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First-passage times, mobile traps, and Hopf bifurcations.

For a random walk on a confined one-dimensional domain, we consider mean first-passage times (MFPT) in the presence of a mobile trap. The question we address is whether a mobile trap can improve capture times over a stationary trap. We consider two scenarios: a randomly moving trap and an oscillating trap. In both cases, we find that a stationary trap actually performs better (in terms of reduc...

متن کامل

Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

متن کامل

Hybrid asymptotic-numerical approach for estimating first-passage-time densities of the two-dimensional narrow capture problem.

A hybrid asymptotic-numerical method is presented for obtaining an asymptotic estimate for the full probability distribution of capture times of a random walker by multiple small traps located inside a bounded two-dimensional domain with a reflecting boundary. As motivation for this study, we calculate the variance in the capture time of a random walker by a single interior trap and determine t...

متن کامل

A multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks

The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...

متن کامل

Sample-dependent first-passage-time distribution in a disordered medium.

Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well described by the annealed continuous-time random walk. We propose an approximate expression for the first-passage-time (FPT) distribution in a given sample that enables detailed comparison of the two problems. For a system of finite size, the number and spatial arrangement of deep traps y...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Multiscale Modeling & Simulation

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2017